Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
نویسندگان
چکیده
منابع مشابه
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
We prove that there is no degree of connectivity which will guarantee that a hypergraph contains two edge-disjoint spanning connected subhypergraphs. We also show that Edmonds’ theorem on arc-disjoint branchings cannot be extended to directed hypergraphs. Here we use a definition of a directed hypergraph that naturally generalizes the notion of a directed graph. For standard notation and result...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملOn spanning tree packings of highly edge connected graphs
We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a sufficient Hamiltonicity condition for the line graphs of such graphs.
متن کاملEdge Disjoint Paths in Moderately Connected Graphs
We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as possible using paths that are mutually edge disjoint. This leads to a variety of classic NP-complete problems, for which approximability is not well understood. We show a polylogarithmic approximation algorithm for the undirected ...
متن کاملFinding 2-edge connected spanning subgraphs
This paper studies the NP-hard problem of /nding a minimum size 2-edge connected spanning subgraph (2-ECSS). An algorithm is given that on an r-edge connected input graph G=(V; E) /nds a 2-ECSS of size at most |V |+(|E|−|V |)=(r−1). For r-regular, r-edge connected input graphs for r = 3, 4, 5 and 6, this gives approximation guarantees of 4 ; 4 3 ; 11 8 and 7 5 , respectively. c © 2003 Elsevier ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00582-6